Separator Theorems and Turán-type Results for Planar Intersection Graphs
نویسنده
چکیده
We establish several geometric extensions of the Lipton-Tarjan separator theorem for planar graphs. For instance, we show that any collection C of Jordan curves in the plane with a total of m crossings has a partition into three parts C = S ∪C1 ∪C2 such that |S| = O( √ m), max{|C1|, |C2|} ≤ 2 3 |C|, and no element of C1 has a point in common with any element of C2. These results are used to obtain various properties of intersection patterns of geometric objects in the plane. In particular, we prove that if a graph G can be obtained as the intersection graph of n convex sets in the plane and it contains no complete bipartite graph Kk,k as a subgraph, then the number of edges of G cannot exceed ckn, for a suitable constant ck.
منابع مشابه
Separators in Region Intersection Graphs
For undirected graphs G (V, E) and G0 (V0 , E0), say that G is a region intersection graph over G0 if there is a family of connected subsets {Ru ⊆ V0 : u ∈ V} of G0 such that {u , v} ∈ E ⇐⇒ Ru ∩ Rv , ∅. We show if G0 excludes the complete graph Kh as a minor for some h > 1, then every region intersection graph G over G0 with m edges has a balanced separator with at most ch √ m nodes, where ch i...
متن کاملPartitioning Graphs with Costs and Weights on Vertices: Algorithms and Applications
We prove separator theorems in which the size of the separator is minimized with respect to non-negative vertex costs. We show that for any planar graph G there exists a vertex separator of total vertex cost at most c q P v2V (G) (cost(v)) 2 and that this bound is optimal within a constant factor. Moreover such a separator can be found in linear time. This theorem implies a variety of other sep...
متن کاملA Separator Theorem for Intersecting Objects in the Plane
Separators in graphs are instrumental in the design of algorithms, having proven to be the key technical tool in approximation algorithms for many optimization problems. In the geometric setting, this naturally translates into the study of separators in the intersection graphs of geometric objects. Recently a number of new separator theorems have been proven for the case of geometric objects in...
متن کاملI/O-Efficient Algorithms for Planar Graphs I: Separators∗
We present I/O-efficient algorithms for computing optimal separator partitions of planar graphs. Our main result shows that, given a planar graph G with N vertices and an integer r > 0, a vertex separator of size O (N/√r) that partitions G into O(N/r) subgraphs of size at most r and boundary size O (√r) can be computed in O(sort(N)) I/Os, provided that M ≥ 56r log B. Together with the planar em...
متن کاملI/O-Efficient Planar Separators
We present I/O-efficient algorithms for computing optimal separator partitions of planar graphs. Our main result shows that, given a planar graph G with N vertices and an integer r > 0, a vertex separator of size O(N/ √ r) that partitions G into O(N/r) subgraphs of size at most r and boundary size O( √ r) can be computed in O(sort(N)) I/Os. This bound holds provided that M ≥ 56r log B. Together...
متن کامل